Proceedings of the 19th ACM Conference on Information and Knowledge Management

Active Media Technology
We are exploring the use of emergent properties of complex systems in a mobile music sharing application. In our approach, songs are treated as individual agents that act autonomously according to input (e.g. listening habits) and given rules. We introduce the concept and report on a study that was conducted to inform the design of such an application. Keywords  Mobile media, mobile music technology, music sharing, emergent systems, media agents  1. 
Partial drift detection using a rule induction framework.

The Effect of Sequence Complexity on the Construction of Protein%2DProtein Interaction Networks.

Partial drift detection using a rule induction framework.

Medical search and classification tools for recommendation.

Medical search and classification tools for recommendation.

A quality%2Daware model for sales prediction using reviews.

Introduction to the special issue on advanced information retrieval and databases.

Discovering Temporal Associations among Significant Changes in Gene Expression.

Diverging patterns discovering significant frequency change dissimilarities in large databases.

Diverging patterns discovering significant frequency change dissimilarities in large databases.

A roadmap of clustering algorithms finding a match for a biomedical application.

Discovering Transitional Patterns and Their Significant Milestones in Transaction Databases.

Efficient layered density%2Dbased clustering of categorical data.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Integration of Genomic

Modeling and Predicting the Helpfulness of Online Reviews.

HelpMeter A Nonlinear Model for Predicting the Helpfulness of Online Reviews.

Rough Sets
A rapid growth of interest in rough set theory [290] and its applications  can be lately seen in the number of international workshops, conferences and  seminars that are either directly dedicated to rough sets, include the subject  in their programs, or simply accept papers that use this approach to solve  problems at hand. A large number of high quality papers on various aspects  of rough sets and their applications have been published in recent years as a  result of this attention. The theory has been followed by the development of  several software systems that implement rough set operations. In Section 12 we  present a list of software systems based on rough sets. Some of the toolkits, provide  advanced graphical environments that support the process of developing  and validating rough set classifiers. Rough sets are applied in many domains,  such as, for instance, medicine, finance, telecommunication, vibration analysis,  conflict resolution, intelligent agents, image analysis, p...
Transitional Patterns and Their Significant Milestones.
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior of frequent patterns in a transaction database. To discover transitional patterns and their significant milestones, first we have to extract all frequent patterns and their supports using any frequent pattern generation algorithm. These frequent patterns are used in the generation of transitional patterns. The existing algorithm (TP-Mine) generates frequent patterns, some of which cannot be used in generation of transitional patterns. In this paper, we propose a modification to the existing algorithm, which prunes the candidate items to be used in the generation of frequent patterns. This method drastically reduces the number of frequent patterns which are used in discovering transitional patterns. Extensive simulation test is done to evaluate the proposed method.
Hierarchical Density%2DBased Clustering of Categorical Data and a Simplification.

Translation and Rotation Invariant Mining of Frequent Trajectories Application to Protein Unfolding Pathways.

Fast Counting with AV%2DSpace for Efficient Rule Induction.

ARSA a sentiment%2Daware model for predicting sales performance using blogs.
Due to its high popularity, Weblogs (or blogs in short) present a wealth of information that can be very helpful in assessing the general public’s sentiments and opinions. In this paper, we study the problem of mining sentiment information from blogs and investigate ways to use such information for predicting product sales performance. Based on an analysis of the complex nature of sentiments, we propose Sentiment PLSA (S-PLSA), in which a blog entry is viewed as a document generated by a number of hidden sentiment factors. Training an S-PLSA model on the blog data enables us to obtain a succinct summary of the sentiment information embedded in the blogs. We then present ARSA, an autoregressive sentiment-aware model, to utilize the sentiment information captured by S-PLSA for predicting product sales performance. Extensive experiments were conducted on a movie data set. We compare ARSA with alternative models that do not take into account the sentiment information, as well as a model with a different feature selection method. Experiments confirm the effectiveness and superiority of the proposed approach.
Clustering by common friends finds locally significant proteins mediating modules.
mediating modules


Clustering large software systems at multiple layers.

Applying Data Mining to Pseudo%2DRelevance Feedback for High Performance Text Retrieval.
In this paper, we investigate the use of data mining, in particular the text classification and co-training techniques, to identify more relevant passages based on a small set of labeled passages obtained from the blind feedback of a retrieval system. The data mining results are used to expand query terms and to re-estimate some of the parameters used in a probabilistic weighting function. We evaluate the data mining based feedback method on the TREC HARD data set. The results show that data mining can be successfully applied to improve the text retrieval performance. We report our experimental findings in detail. 1
Personalized recommendation with adaptive mixture of markov models.

Efficient indirect association discovery using compact transaction databases.

Applying Data Mining to Pseudo%2DRelevance Feedback for High Performance Text Retrieval.
In this paper, we investigate the use of data mining, in particular the text classification and co-training techniques, to identify more relevant passages based on a small set of labeled passages obtained from the blind feedback of a retrieval system. The data mining results are used to expand query terms and to re-estimate some of the parameters used in a probabilistic weighting function. We evaluate the data mining based feedback method on the TREC HARD data set. The results show that data mining can be successfully applied to improve the text retrieval performance. We report our experimental findings in detail. 1
Mining and Modeling Database User Access Patterns.

Boosting Prediction Accuracy on Imbalanced Datasets with SVM Ensembles.
Abstract. Learning from imbalanced datasets is inherently difficult due to lack of information about the minority class. In this paper, we study the performance of SVMs, which have gained great success in many real applications, in the imbalanced data context. Through empirical analysis, we show that SVMs suffer from biased decision boundaries, and that their prediction performance drops dramatically when the data is highly skewed. We propose to combine an integrated sampling technique with an ensemble of SVMs to improve the prediction performance. The integrated sampling technique combines both over-sampling and under-sampling techniques. Through empirical study, we show that our method outperforms individual SVMs as well as several other state-of-the-art classifiers. 1
A platform for Okapi%2Dbased contextual information retrieval.

York University at TREC 2006 Enterprise Email Discussion Search.

Bi%2Dlevel clustering of mixed categorical and numerical biomedical data.

Hierarchical grouping of association rules and its application to a real%2Dworld domain.

An efficient approach to mining indirect associations.

Applying language modeling to session identification from database trace logs.

Finding and Analyzing Database User Sessions.

Representing UML Snowflake Diagram from Integrating XML Data Using XML Schema.


A Machine Learning Approach to Identifying Database Sessions Using Unlabeled Data.

Compact transaction database for efficient frequent pattern mining.


Clustering mixed numerical and low quality categorical data significance metrics on a yeast example.

A Distance%2DBased Algorithm for Clustering Database User Sessions.

York University at TREC 2005 HARD Track.

York University at TREC 2005 SPAM Track.
We propose a variant of the k-nearest neighbor classification method, called  instance-weighted k-nearest neighbor method, for adaptive spam filtering. The method  assigns two weights, distance weight and correctness weight, to a training instance, and  makes use of the two weights when classifying a new email. The correctness weight is also  used in the maintenance of the training data to make the training data more adaptive to the  changes of spam characteristics. We submitted 4 spam filters to the Spam Track. Two of  the filters are purely based on the instance-weighted kNN method. The two other filters  combine the kNN method with other spam filtering and classification techniques. We report  the official results of our submissions on the Spam Track evaluation data sets.
Multiple Layer Clustering of Large Software Systems.
Software clustering algorithms presented in the literature rarely incorporate in the clustering process dynamic information, such as the number of function invocations during runtime. Moreover, the structure of a software system is often multi-layered, while existing clustering algorithms often create flat system decompositions. This paper presents a software clustering algorithm called MULICsoft that incorporates in the clustering process both static and dynamic information. MULICsoft produces layered clusters with the core elements of each cluster assigned to the top layer. We present experimental results of applying MULICsoft to a large open-source system. Comparison with existing software clustering algorithms indicates that MULICsoft is able to produce decompositions that are close to those created by system experts. 1.
Characterizing Database User%27s Access Patterns.

Clustering Web Surfers with Probabilistic Models in a Real Application.

Dynamic Web log session identification with statistical language models.
We present a novel session identification method based on statistical language modeling.
Feature Selection with Rough Sets for Web Page Classification.
Abstract. Web page classification is the problem of assigning predefined categories to web pages. A challenge in web page classification is how to deal with the high dimensionality of the feature space. We present a feature reduction method based on the rough set theory and investigate the effectiveness of the rough set feature selection method on web page classification. Our experiments indicate that rough set feature selection can improve the predictive performance when the original feature set for representing web pages is large. 1
Efficient Mining of Indirect Associations Using HI%2DMine.
Abstract. Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has been noted recently that some of the infrequent patterns, such as indirect associations, provide useful insight into the data. In this paper, we propose an efficient algorithm, called HI-mine, based on a new data structure, called HI-struct, for mining the complete set of indirect associations between items. Our experimental results show that HI-mine&#039;s performance is significantly better than that of the previously developed algorithm for mining indirect associations on both synthetic and real world data sets over practical ranges of support specifications. 1
Session Boundary Detection for Association Rule Learning Using n%2DGram Language Models.
We present a statistical method using n-gram language models  to identify session boundaries in a large collection of Livelink log data.
Using User Access Patterns for Semantic Query Caching.

Objective and Subjective Algorithms for Grouping Association Rules.
We propose two algorithms for grouping and summarizing association rules. The first algorithm recursively groups rules according to the structure of the rules and generates a tree of clusters as a result. The second algorithm groups the rules according to the semantic distance between the rules by making use of an autometically tagged semantic tree-structured network of items. We provide a case study in which the proposed algorithms are evaluated. The results show that our grouping methods are effective and produce good grouping results. 1
SQL%2DRelay An Event%2DDriven Rule%2DBased Database Gateway.
Database users often submit similar queries to retrieve certain information from
Comparison of interestingness functions for learning web usage patterns.

Discovery of Interesting Association Rules from Livelink Web Log Data.

From Computational Intelligence to Web Intelligence.

A Case Study for Learning from Imbalanced Data Sets.

Comparisons of Classification Methods for Screening Potential Compounds.

Rule Quality Measures for Rule Induction Systems Description and Evaluation.

CViz An Interactive Visualization System for Rule Induction.

Rule Quality Measures Improve the Accuracy of Rule Induction An Experimental Approach.

Probability%2DBased Chinese Text Processing and Retrieval.

ORTES The Design of a Real%2DTime Control Expert System.

Discretization of Continuous Attributes for Learning Classification Rules.

An Empirical Study on Rule Quality Measures.

Rule%2DInduction and Case%2DBased Reasoning Hybrid Architectures Appear Advantageous.

ELEM2 A Learning System for More Accurate Classifications.

Integrating Rule Induction and Case%2DBased Reasoning to Enhance Problem Solving.

Applying Knowledge Discovery to Predict Water%2DSupply Consumption.

Object%2DOriented Modelling and Simulation of an Expert System for Monitoring and Control of a Water Distribution System.

